An Identification Algorithm for Evolutionary Community on Mobile Social Network

In mobile social network, detecting community structure reduces a complexity of the network consisted of large datasets, which is important to manage and understand components of the network. Link Community Detection (LCD) is a method that finds out community structure using similarity between two neighboring edges and partition density. Communities detected by this method can have overlapping nodes. Also it can detect community structure in dynamic network. But it cannot know identity of each community between time and + . Moreover, if the network is greatly changed in a short time, it is unable to reveal communities’ identity. Therefore, we propose an identification algorithm for evolutionary community. The idea of proposed method is to track communities in detection process by comparing similarity between communities and established element of community.